Maximum Pseudo-Likelihood Estimation Minimizes Conditional Description Length
نویسندگان
چکیده
In this paper we discuss a method, which we call Minimum Conditional Description Length (MCDL), for estimating the parameters of a subset of sites within a Markov random field. We assume that the edges are known for the entire graph G = (V,E). Then, for a subset U ⊂ V , we estimate the parameters for nodes and edges in U as well as for edges incident to a node in U , by finding the exponential parameter for that subset that yields the best compression conditioned on the values on the boundary ∂U . Our estimate is derived from a temporally stationary sequence of observations on the set U . We discuss how this method can also be applied to estimate a spatially invariant parameter from a single configuration, and in so doing, derive the Maximum Pseudo-Likelihood (MPL) estimate.
منابع مشابه
Conditional Maximum Likelihood Estimation of the First-Order Spatial Integer-Valued Autoregressive (SINAR(1,1)) Model
‎Recently a first-order Spatial Integer-valued Autoregressive‎ ‎SINAR(1,1) model was introduced to model spatial data that comes‎ ‎in counts citep{ghodsi2012}‎. ‎Some properties of this model‎ ‎have been established and the Yule-Walker estimator has been‎ ‎proposed for this model‎. ‎In this paper‎, ‎we introduce the...
متن کاملUnifying Non-Maximum Likelihood Learning Objectives with Minimum KL Contraction
When used to learn high dimensional parametric probabilistic models, the classical maximum likelihood (ML) learning often suffers from computational intractability, which motivates the active developments of non-ML learning methods. Yet, because of their divergent motivations and forms, the objective functions of many non-ML learning methods are seemingly unrelated, and there lacks a unified fr...
متن کاملAccelerated Estimation of Conditional Random Fields using a Pseudo-Likelihood-inspired Perceptron Variant
We discuss a simple estimation approach for conditional random fields (CRFs). The approach is derived heuristically by defining a variant of the classic perceptron algorithm in spirit of pseudo-likelihood for maximum likelihood estimation. The resulting approximative algorithm has a linear time complexity in the size of the label set and contains a minimal amount of tunable hyper-parameters. Co...
متن کاملLayered Representation of Motion Video using Robust Maximum - LikelihoodEstimation of Mixture Models and MDL
Representing and modeling the motion and spatial support of multiple objects and surfaces from motion video sequences is an important intermediate step towards dynamic image understanding. One such representation, called layered representation, has recently been proposed. Although a number of algorithms have been developed for computing these representations, there has not been a consolidated e...
متن کاملIdentification and Estimation of Continuous Time Dynamic Games
We consider the theoretical and econometric properties of a recently proposed class of continuous time dynamic games with discrete choices. This class of models has computationally-desirable properties and includes widely-used entry, exit, and investment games that underlie many applications in empirical industrial organization. First, we establish a linear representation of the value functions...
متن کامل